LU decomposition of totally nonnegative matrices
نویسندگان
چکیده
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.
منابع مشابه
Bounding the error in Gaussian elimination for tridiagonal systems
If is the computed solution to a tridiagonal system Ax b obtained by Gaussian elimination, what is the "best" bound available for the error x and how can it be computed efficiently? This question is answered using backward error analysis, perturbation theory, and properties of the LU factorization of A. For three practically important classes of tridiagonal matrix, those that are symmetric posi...
متن کاملEla on a Schur Complement Inequality for the Hadamard Product of Certain Totally Nonnegative Matrices
Under the entrywise dominance partial ordering, T.L. Markham and R.L. Smith obtained a Schur complement inequality for the Hadamard product of two tridiagonal totally nonnegative matrices. Applying the properties of the Hadamard core of totally nonnegative matrices, the Schur complement inequalities for the Hadamard product of totally nonnegative matrices is obtained, which extends those of T.L...
متن کاملTotally nonnegative cells and matrix Poisson varieties
We describe explicitly the admissible families of minors for the totally nonnegative cells of real matrices, that is, the families of minors that produce nonempty cells in the cell decompositions of spaces of totally nonnegative matrices introduced by A. Postnikov. In order to do this, we relate the totally nonnegative cells to torus orbits of symplectic leaves of the Poisson varieties of compl...
متن کاملOn a Schur complement inequality for the Hadamard product of certain totally nonnegative matrices
Under the entrywise dominance partial ordering, T.L. Markham and R.L. Smith obtained a Schur complement inequality for the Hadamard product of two tridiagonal totally nonnegative matrices. Applying the properties of the Hadamard core of totally nonnegative matrices, the Schur complement inequalities for the Hadamard product of totally nonnegative matrices is obtained, which extends those of T.L...
متن کاملAccurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
We present new O(n3) algorithms that compute eigenvalues and eigenvectors to high relative accuracy in floating point arithmetic for the following types of matrices: symmetric Cauchy, symmetric diagonally scaled Cauchy, symmetric Vandermonde, and symmetric totally nonnegative matrices when they are given as products of nonnegative bidiagonal factors. The algorithms are divided into two stages: ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011